A Two-stage Flow Shop Scheduling with a Critical Machine and Batch Availability
نویسنده
چکیده
We study a two-stage flowshop, where each job is processed on the first (critical) machine, and then continues to one of two second-stage (dedicated) machines. We assume identical (but machine-dependent) job processing times. Jobs are processed on the critical machine in batches, and a setup time is required when starting a new batch. The setting assumes batch-availability, i.e., jobs become available for the second stage only when their entire batch is completed on the critical machine. We consider three objective functions: minimum makespan, minimum total load, and minimum weighted flow-time. Polynomial time dynamic programming algorithms are introduced, which are numerically shown to be able to solve problems of medium size in reasonable time. A heuristic for makespan minimization is presented and shown numerically to be both accurate and efficient..
منابع مشابه
Particle swarm optimization for minimizing total earliness/tardiness costs of two-stage assembly flowshop scheduling problem in a batched delivery system
This paper considers a two-stage assembly flow shop scheduling problem. When all parts of each product are completed in the first stage, they are assembled into a final product on an assembly machine in the second stage. In order to reduce the delivery cost, completed products can be held until completion of some other products to be delivered in a same batch. The proposed problem addresses sch...
متن کاملAppling Metaheuristic Algorithms on a Two Stage Hybrid Flowshop Scheduling Problem with Serial Batching (RESEARCH NOTE)
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is investigated. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among th...
متن کاملA Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملA New Approach Generating Robust and Stable Schedules in m-Machine Flow Shop Scheduling Problems: A Case Study
This paper considers a scheduling problem with uncertain processing times and machine breakdowns in industriall/office workplaces and solves it via a novel robust optimization method. In the traditional robust optimization, the solution robustness is maintained only for a specific set of scenarios, which may worsen the situation for new scenarios. Thus, a two-stage predictive algorithm is prop...
متن کامل